Axiomatizing Probabilistic Processes: ACP with Generative Probabilities

نویسندگان

  • Jos C. M. Baeten
  • Jan A. Bergstra
  • Scott A. Smolka
چکیده

This paper is concerned with finding complete axiomatizations of probabilistic processes. We examine this problem within the context of the process algebra ACP and obtain as our end-result the axiom system prACPi, a probabilistic version of ACP which can be used to reason algebraically about the reliability and performance of concurrent systems. Our goal was to introduce probability into ACP in as simple a fashion as possible. Optimally, ACP should be the homomorphic image of the probabilistic version in which the probabilities are forgotten. We begin by weakening slightly ACP to obtain the axiom system ACPi. The main difference between ACP and ACPi is that the axiom z + 6 = z, which does not yield a plausible interpretation in the generative model of probabilistic computation, is rejected in ACPi. We argue that this does not affect the usefulness of ACPi in practice, and show how ACP can be reconstructed from ACP; with a minimal amount of technical machinery. prACPi is obtained from ACPi through the introduction of probabilistic alternative and parallel composition operators, and a process graph model for prACPi based on probabilistic bisimulation is developed. We show that prACPi is a sound and complete axiomatization of probabilistic bisimulation for finite processes, and that prACPi can be homomorphically embedded in ACPi as desired. Our results for ACPi and prACPi are presented in a modular fashion by first considering several subsets of the signatures. We conclude with a discussion about the suitability of an internal probabilisti:: choice operaior in the context of p1'ACPr' • A preliminary version 0: t.b.is paper appeared in Proceetiing& o.z COSCCR '9! Thire International Conference on Concurrency Theory, Yo1. 630 of the Springer .. Verlag series Lecture SotC$ in Computer Science, pp. 472-485, Aug. 1992. The research ofthe first and second authors was supported by ESPRIT Basic Research Action 7166, CONCUR2. The second author was also supported by RACE project 1046, SPECS. This document does not necessarily reflect the views of the SPECS consortium. The research of the third author was supported by NSF grants CCR-8704309, CCR-9120995, and CCR-9208585.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reactive, Generative, and Stratified Models of Probabilistic Processes

12a. DISTRIBUTION / AVAILABILITY STATEMENT 12b. DISTRIBUTION CODE 13. ABSTRACT (Maximum 200 words) We introduce three models of probabilistic processes, namely, reactive, generative and stratified. These models are investigated within the context of PCCS, an extension of Milner's SCCS in which each summand of a process summation expression is guarded by a probability and the sum of these probab...

متن کامل

Reactive, Generative and Strati ed Models of Probabilistic Processes

We introduce three models of probabilistic processes, namely, reactive, generative and strati ed. These models are investigated within the context of PCCS, an extension of Milner's SCCS in which each summand of a process summation expression is guarded by a probability and the sum of these probabilities is 1. For each model we present a structural operational semantics of PCCS and a notion of b...

متن کامل

Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes

One of the most studied extensions of testing theory to nondeterministic and probabilistic processes yields unrealistic probabilities estimations that give rise to two anomalies. First, probabilistic testing equivalence does not imply probabilistic trace equivalence. Second, probabilistic testing equivalence differentiates processes that perform the same sequence of actions with the same probab...

متن کامل

Testing Semantics for Probabilistic LOTOS

In this paper we present a probabilistic extension of LOTOS which is upward compatible with LOTOS. We present testing semantics for the reactive and generative models described in vGSST90]. While there is a certain lose of the meaning of probabilities in the reactive model, testing with probabilistic tests proves to be too strong, because it does not relate behavior expressions which we expect ...

متن کامل

An Asynchronous Calculus for Generative-Reactive Probalistic Systems

We present an asynchronous calculus for describing and analyzing probabilistic distributed systems that combines, in a simple way, probabilistic internal/external choices and multi-way synchronization, by employing the generative-reactive approach of EMPAgr. Such an approach is based on master-slave discipline which leads to a clear notion of control over action synchronizations. Moreover the m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Comput.

دوره 121  شماره 

صفحات  -

تاریخ انتشار 1995